منابع مشابه
Enumeration by kernel positions for strongly Bernoulli type truncation games on words
We find the winning strategy for a class of truncation games played on words. As a consequence of the present author’s recent results on some of these games we obtain new formulas for Bernoulli numbers and polynomials of the second kind and a new combinatorial model for the number of connected permutations of given rank. For connected permutations, the decomposition used to find the winning str...
متن کاملEnumeration of Derangements with Descents in Prescribed Positions
We enumerate derangements with descents in prescribed positions. A generating function was given by Guo-Niu Han and Guoce Xin in 2007. We give a combinatorial proof of this result, and derive several explicit formulas. To this end, we consider fixed point λ-coloured permutations, which are easily enumerated. Several formulae regarding these numbers are given, as well as a generalisation of Eule...
متن کاملGrid polygons from permutations and their enumeration by the kernel method
A grid polygon is a polygon whose vertices are points of a grid. We define an injective map between permutations of length n and a subset of grid polygons on n vertices, which we call consecutive-minima polygons. By the kernel method, we enumerate sets of permutations whose consecutive-minima polygons satisfy specific geometric conditions. We deal with 2-variate and 3-variate generating functions.
متن کاملInduction by Enumeration
Induction by enumeration has a clear interpretation within the numerical paradigm of inductive discovery (i.e., the one pioneered by [Gold, 1967]). The concept is less easily interpreted within the first-order paradigm discussed by [Kelly, 1996, Martin & Osherson, 1998], in which the scientist’s data amount to the basic diagram of a structure. We formulate two kinds of enumerative induction tha...
متن کاملAsymptotic enumeration of dense 0-1 matrices with specified line sums and forbidden positions
Let s = (s1, s2, . . . , sm) and t = (t1, t2, . . . , tn) be vectors of non-negative integers with ∑m i=1 si = ∑n j=1 tj, and let X = (xjk) be an m × n matrix over {0, 1}. Define B(s, t,X) to be the number of m×n matrices B = (bjk) over {0, 1} with row sums given by s and column sums given by t such that xjk = 1 implies bjk = 0 for all j, k. That is, X specifies a set of entries of B required t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Mathematics
سال: 2009
ISSN: 0196-8858
DOI: 10.1016/j.aam.2008.11.001